Factorisation of Large Integers on some Vector and Parallel Computers
نویسندگان
چکیده
A list of technical reports, including some abstracts and copies of some full reports may be found at: Abstract We compare implementations of two integer factorization algorithms, the elliptic curve method (ECM) and a variant of the Pollard \rho" method, on three machines with parallel and/or vector architectures. ECM is scalable and well suited for both vector and parallel architectures. The \rho" method is simpler than ECM but is not scalable.
منابع مشابه
A compact algorithm for Gaussian elimination over GF(2) implemented on highly parallel computers
Gaussian elimination over GF(2) is used in a number of applications including the factorisation of large integers. The boolean nature of arithmetic in GF(2) makes the task well suited to highly parallel bit-organised computers. A program to work with up to 4096X4096 matrices has been developed for the ICL-DAP. A method has been developed that needs no extra storage to store the history of the e...
متن کاملParallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers
This paper parallelizes the spatial pyramid match kernel (SPK) implementation. SPK is one of the most usable kernel methods, along with support vector machine classifier, with high accuracy in object recognition. MATLAB parallel computing toolbox has been used to parallelize SPK. In this implementation, MATLAB Message Passing Interface (MPI) functions and features included in the toolbox help u...
متن کاملVector and Parallel Algorithms for Integer Factorisation
The problem of finding the prime factors of large composite numbers is of practical importance since the advent of public key cryptosystems whose security depends on the presumed difficulty of this problem. In recent years the best known integer factorisation algorithms have improved greatly. It is now routine to factor 60-decimal digit numbers, and possible to factor numbers of more than 110 d...
متن کاملParallel Solution of Linear Systems by Quadrant Interlocking Factorisation Methods
This paper presents a parallel algorithm for the solution of linear systems and determinant evaluation suitable for use on the proposed parallel computers of the future. The new method can be considered as extending the novel matrix factorisation strategies introduced by Evans and Hatzopoulos [l] and Evans and Hadjidimos [2] in which quadrant interlocking factors are considered instead of the m...
متن کاملFactoring Integers above 100 Digits Using Hypercube Mpqs 1 Scope and Achievements
In this paper we report on further progress with the factorisation of integers using the MPQS algorithm on hypercubes and a MIMD parallel computer with 1024 T805 processors. We were able to factorise a 101 digit number from the Cunningham list using only about 65 hours computing time. We give new details about the hypercube sieve initialisation procedure and describe the structure of the factor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995